Generalizing the column–row matrix decomposition to multi-way arrays

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalizing the Column-Row Matrix Decomposition to Multi-way Arrays

In this paper, we provide two generalizations of the CUR matrix decomposition Y = CUR (also known as pseudo-skeleton approximation method [1]) to the case of N-way arrays (tensors). These generalizations, which we called Fiber Sampling Tensor Decomposition types 1 and 2 (FSTD1 and FSTD2), provide explicit formulas for the parameters of a rank-(R,R, ..., R) Tucker representation (the core tensor...

متن کامل

Iterative methods for the canonical decomposition of multi-way arrays: Application to blind underdetermined mixture identification

Two main drawbacks can be stated in the Alternating Least Square (ALS) algorithm used to fit the CANonical Decomposition (CAND) of multi-way arrays. First its slow convergence caused by the presence of collinearity between factors in the multi-way array it decomposes. Second its blindness to Hermitian symmetries of the considered arrays. Enhanced Line Search (ELS) scheme was found to be a good ...

متن کامل

On the uniqueness of multilinear decomposition of N-way arrays

i.e. X can be written as a sum of three outer products of the respective component vectors, which constitute rank-1 matrices. Let A := [a1, a2, a3] and B := [b1, b2, b3], and X can be expressed as X = AB. Note the trivial fact that ATTB = X for any invertible T; hence, given X, infinitely many (A, B) pairs can potentially give rise to X. Unless some additional structure is assumed or JOURNAL OF...

متن کامل

Application of the Multilevel Matrix Decomposition Algorithm to the Frequency Analysis of Large Microstrip Antenna Arrays

The application of integral equation methods based in the method of moments discretization to solve large antenna arrays is difficult due to the fact that the computational requirements increase rapidly with the number of unknowns. This is critical when a frequency analysis of the antenna is required. We propose the multilevel matrix decomposition algorithm (MLMDA) to carry out this purpose eff...

متن کامل

Generalizing the probability matrix decomposition model : anexample of Bayesian model checking and model expansion

Probability matrix decomposition (PMD) models can be used to explain observed associations between two sets of elements. More speciically, observed associations are modeled as a deterministic function of B latent Bernoulli variables that are realized for each element. To estimate the parameters of this model, a sample of the posterior distribution is computed with a data augmentation algorithm....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2010

ISSN: 0024-3795

DOI: 10.1016/j.laa.2010.03.020